Skip to main content

All Questions

4votes
1answer
183views

Shakesort in Python 3

I've done the shakesort algorithm win \$O(n^2)\$, but it doesn't seem that \$O(n^2)\$ is correct because it takes 6-9 steps in the while loop for a list of 4 ...
jkansjkdkas's user avatar

close